A simple,rapid and sensitive method based on modified multiwalled carbon nanotube for preconcentration and determination of lead ions in aqueous media in natural pHs

In this study, multiwalled carbon nanotube (MWCNT) was modified by the pyridine group using a silane agent and characterized by infrared spectroscopy (IR), thermal analysis (TG/DTA), and elemental analysis (CHN) and scanning electron microscopy (SEM). The application of this sorbent was investigated in determination of lead ions in aqueous samples, using flame atomic absorption spectrometry (FAAS). Through this study, different parameters such as pH and sample flow rate on adsorption process and eluent concentration, volume and flow rate were optimized. The limit of detection (LOD), the relative standard deviation and the recovery of the method were 2 ng mL^?1, 1.3% and 99.7%, respectively. Two standard reference materials (NIST 1571 and NIST 1572) were used to verify accuracy of this method. Finally, the sorbent was successfully applied for extraction and determination of low levels of Pb(II) ions in aqueous samples.     

Phase transitions in graphs on orientable surfaces

Let be the orientable surface of genus and denote by the class of all graphs on vertex set with edges embeddable on . We prove that the component structure of a graph chosen uniformly at random from features two phase transitions. The first phase transition mirrors the classical phase transition in the Erd?s‐Rényi random graph chosen uniformly at random from all graphs with vertex set and edges. It takes place at , when the giant component emerges. The second phase transition occurs at , when the giant component covers almost all vertices of the graph. This kind of phenomenon is strikingly different from and has only been observed for graphs on surfaces.     

The chromatic number of random Borsuk graphs

We study a model of random graph where vertices are n i.i.d. uniform random points on the unit sphere S^d in , and a pair of vertices is connected if the Euclidean distance between them is at least 2??. We are interested in the chromatic number of this graph as n tends to infinity. It is not too hard to see that if ?>0 is small and fixed, then the chromatic number is d+2 with high probability. We show that this holds even if ?→0 slowly enough. We quantify the rate at which ? can tend to zero and still have the same chromatic number. The proof depends on combining topological methods (namely the Lyusternik–Schnirelman–Borsuk theorem) with geometric probability arguments. The rate we obtain is best possible, up to a constant factor—if ?→0 faster than this, we show that the graph is (d+1)‐colorable with high probability.25     

Regularity and Rigidity for Nonlocal Curvatures in Conformal Geometry

In this paper, we will explore the geometric effects of conformally covariant operators and the induced nonlinear curvature equations in certain nonlocal nature. Mainly, we will prove some regularity and rigidity results for the distributional solutions to those equations.     

Information percolation and cutoff for the random‐cluster model

We consider the random‐cluster model (RCM) on with parameters p∈(0,1) and q ≥ 1. This is a generalization of the standard bond percolation (with edges open independently with probability p) which is biased by a factor q raised to the number of connected components. We study the well‐known Fortuin‐Kasteleyn (FK)‐dynamics on this model where the update at an edge depends on the global geometry of the system unlike the Glauber heat‐bath dynamics for spin systems, and prove that for all small enough p (depending on the dimension) and any q>1, the FK‐dynamics exhibits the cutoff phenomenon at with a window size , where λ_∞ is the large n limit of the spectral gap of the process. Our proof extends the information percolation framework of Lubetzky and Sly to the RCM and also relies on the arguments of Blanca and Sinclair who proved a sharp mixing time bound for the planar version. A key aspect of our proof is the analysis of the effect of a sequence of dependent (across time) Bernoulli percolations extracted from the graphical construction of the dynamics, on how information propagates.     

There is no (95, 40, 12, 20) strongly regular graph

We show that there is no (95, 40, 12, 20) strongly regular graph and, consequently, there is no (96, 45, 24, 18) strongly regular graph, no nontrivial regular two‐graph on 96 vertices, and no partial geometry pg(4, 9, 2). The main idea of the result is based on the star complement technique and requires a moderate amount of computation.     

Existence and Uniqueness of Solution for a Class of Nonlinear Degenerate Elliptic Equations

In this work we are interested in the existence and uniqueness of solutions for the Navier problem associated to the degenerate nonlinear elliptic equations■,in the setting of the weighted Sobolev spaces.